Optimizing Extender Code for NCSX Analyses
نویسندگان
چکیده
Extender[1] is a parallel C++ code for calculating the magnetic field in the vacuum region of a stellarator. The code was optimized for speed and augmented with tools to maintain a specialized NetCDF database. Two parallel algorithms were examined. An even-block work-distribution scheme was comparable in performance to a master-slave scheme. Large speedup factors were achieved by representing the plasma surface with a spline rather than Fourier series. The accuracy of this representation and the resulting calculations relied on the density of the spline mesh. The Fortran 90 module db access was written to make it easy to store Extender output in a manageable database. New or updated data can be added to existing databases. A generalized PBS job script handles the generation of a database from scratch.
منابع مشابه
Ncsx Magnetic Configuration Flexibility and Robustness
The National Compact Stellarator Experiment (NCSX) will study the physics of low–aspect ratio, high-b, quasi-axisymmetric stellarators. To achieve the scientific goals of the NCSX mission, the device must be capable of supporting a wide range of variations in plasma configuration about a reference baseline equilibrium. We demonstrate the flexibility of NCSX coils to support such configuration v...
متن کاملOASIS: An Optimizing Action-Based Compiler Generator
Action Semantics is a new and interesting foundation for semantics based compiler generation. In this paper we present several analyses of actions, and apply them in a compiler generator capable of generating efficient, optimizing compilers for procedural and functional languages with higher order recursive functions.The automatically generated compilers produce code that is comparable with cod...
متن کاملPhase-ordering in optimizing compilers
The " quality " of code generated by compilers largely depends on the analyses and optimizations applied to the code during the compilation process. While modern compilers could choose from a plethora of optimizations and analyses, in current compilers the order of these pairs of analyses/transformations is fixed once and for all by the compiler developer. Of course there exist some flags that ...
متن کاملSuccessor levels of the Jensen hierarchy
I prove that there is a recursive function T that does the following: Let X be transitive and rud closed, and let X ′ be the closure of X ∪{X} under rud functions. Given a Σ0 formula φ(x) and a code c for a rud function f , T (φ, c, ~x) is a Σω formula such that for any ~a ∈ X, X ′ |= φ[f(~a)] iff X |= T (φ, c, ~x)[~a]. I make this precise and show relativized versions of this. As an applicatio...
متن کاملA Structured Approach to Proving Compiler Optimizations Based on Dataflow Analysis
This paper reports on the correctness proof of compiler optimizations based on data-flow analysis. We formulate the optimizations and analyses as instances of a general framework for data-flow analyses and transformations, and prove that the optimizations preserve the behavior of the compiled programs. This development is a part of a larger effort of certifying an optimizing compiler by proving...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008